New Covering Array Numbers
نویسندگان
چکیده
A covering array CA(N ; t, k, v) is anN×k array on v symbols such that everyN×t subarray contains as a row each t-tuple over the v symbols at least once. The minimum N for which a CA(N ; t, k, v) exists is called the covering array number of t, k, and v, and it is denoted by CAN(t, k, v). In this work we prove that if exists CA(N ; t+ 1, k + 1, v) it can be obtained from the juxtaposition of v covering arrays CA(N0; t, k, v), . . ., CA(Nv−1; t, k, v), where
منابع مشابه
Constructing new covering arrays from LFSR sequences over finite fields
Let q be a prime power and Fq be the finite field with q elements. A q-ary m-sequence is a linear recurrence sequence of elements from Fq with the maximum possible period. A covering array CA(N ; t, k, v) of strength t is a N ×k array with entries from an alphabet of size v, with the property that any N×m subarray has at least one row equal to every possible m-tuple of the alphabet. The coverin...
متن کاملUsing the Particle Swarm Optimization Algorithm to Generate the Minimum Test Suite in Covering Array with Uniform Strength
Up to now, several useful algorithms have been proposed to generate covering array, which is one of the branches of combinatorial testing. The main challenge in generating such arrays is generation of the arrays with a minimum number of test cases (for efficiency) at a proper time (for performance), for large systems. Covering array generation strategies are often divided into two general categ...
متن کاملCover starters for covering arrays of strength two
A cover starter is a single vector that yields a covering array under the actions of groups on both the columns and the symbols of the starter. The existence of this compact representation of covering arrays facilitates effective exhaustive and heuristic search. When the group action on symbols fixes a small number f of symbols, such cover starters lead to covering arrays that embed covering ar...
متن کاملProducts of Mixed Covering Arrays of Strength Two
A covering array CA(N ; t, k, v) is an N × k array such that every N × t sub-array contains all t-tuples from v symbols at least once, where t is the strength of the array. Covering arrays are used to generate software test suites to cover all t-sets of component interactions. The particular case when t = 2 (pairwise coverage) has been extensively studied, both to develop combinatorial construc...
متن کاملBranch Point Structure of Covering Maps onto Nonorientable Surfaces
Let /: M -> N be a degree n branched cover onto a compact, connected nonorientable surface with branch points yx, y2.ym in N, and let the multiplicities at points in f~\y¡) be fti, fto • • • > Kv The branching array of/, designated by B, is the following array of numbers: fll'Ml2> • • -«Mi*, /*2i' to • • • » f*2*2 fini' Mm2> • • • ' /Vu We show that the numbers in the branching array must alway...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1711.10040 شماره
صفحات -
تاریخ انتشار 2017